Permutation Complexity and Coupling Measures in Hidden Markov Models
نویسندگان
چکیده
منابع مشابه
Permutation Complexity and Coupling Measures in Hidden Markov Models
In [Haruna, T. and Nakajima, K., 2011. Physica D 240, 13701377], the authors introduced the duality between values (words) and orderings (permutations) as a basis to discuss the relationship between information theoretic measures for finite-alphabet stationary stochastic processes and their permutation analogues. It has been used to give a simple proof of the equality between the entropy rate a...
متن کاملRhythm complexity and Hidden Markov Models
One of the main objectives of a logician is to reason all romance out of life. A book is a set of words, which can be analyzed, quantified over and reduced to a set of possible worlds. Philosophy is but a mere set of faulty axioms. And music... music is just a set of notes, containing patterns we can formalize. Sorry Shakespear, Hobbes and Chopin. Art is nothing but a poor understanding of the ...
متن کاملComplexity of Comparing Hidden Markov Models
1 Baskin Center for Computer S ien e and Engineering, University of California, Santa Cruz, CA 95064, U.S.A. E-mail: rlyngsoe se.u s .edu 2 BiRC⋆ ⋆ ⋆, Department of Computer S ien e, University of Aarhus, Ny Munkegade, DK-8000 Århus C, Denmark. E-mail: storm daimi.au.dk. Abstra t The basi theory of hidden Markov models was developed and applied to problems in spee h re ognition in the late 1960...
متن کاملCharacterizing sequence knowledge using online measures and hidden Markov models.
What knowledge do subjects acquire in sequence-learning experiments? How can they express that knowledge? In two sequence-learning experiments, we studied the acquisition of knowledge of complex probabilistic sequences. Using a novel experimental paradigm, we were able to compare reaction time and generation measures of sequence knowledge online. Hidden Markov models were introduced as a novel ...
متن کاملMetrics and Similarity Measures for Hidden Markov Models
Hidden Markov models were introduced in the beginning of the 1970's as a tool in speech recognition. During the last decade they have been found useful in addressing problems in computational biology such as characterising sequence families, gene finding, structure prediction and phylogenetic analysis. In this paper we propose several measures between hidden Markov models. We give an efficient ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2013
ISSN: 1099-4300
DOI: 10.3390/e15093910